Upper semi-lattice of binary strings with the relation “x is simple conditional to y”
نویسندگان
چکیده
منابع مشابه
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y"
We study the properties of the set of binary strings with the relation \the Kolmogorov complexity of x conditional to y is small". We prove that there are pairs of strings which have no greatest common lower bound with respect to this pre-order. We present several examples when the greatest common lower bound exists but its complexity is much less than mutual information (extending G acs and K...
متن کاملConnections between C(X) and C(Y), where Y is a subspace of X
In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...
متن کاملazerbaijans political development after the collapse of soviet union and implication on relation with the islamic republic of iran
در فصل اول این پایاین نامه در خصوص تاریخ کشور اذربایجان قبل و بعد از جدایی این کشور از ایران مورد بررسی قرار گرفته است ودر فصل دوم تحولات سیاسی این کشور بعد از 1991 و در واقع بعد از فروپاشی شوروی و دولتهایی که روی کار امدند در از جمله دولت ابولفضل ایلچی بیگ،دولت حیدر علی اف وبعد از او پسرش الهام علی اف و نگرش هرکدام از این دولتها به سیاسیت خارجی اذربایجان مورد اشاره قرار گرفته است.در ودر فصل سو...
Simple Semi-conditional Et0l Grammars
The present contribution introduces and studies simple semi-conditional ET0L grammars (SSC-ET0L grammars for short). It is demonstrated that SSC-ET0L grammars with permitting and forbidding conditions of length no more than one and two, respectively, generate all the family of recursively enumerable languages; if erasing productions are not allowed, these grammars generate precisely the family ...
متن کاملUpper and lower $alpha(mu_{X},mu_{Y})$-continuous multifunctions
In this paper, a new class of multifunctions, called generalized $alpha(mu_{X},mu_{Y})$-continuous multifunctions, has been dened and studied. Some characterizations and several properties concerning generalized $alpha(mu_{X},mu_{Y})$-continuous multifunctions are obtained. The relationships between generalized $alpha(mu_{X},mu_{Y})$-continuous multifunctions and some known concepts are also di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00032-9